On Minimal Resolution Proof Systems for Resolution Logics
نویسنده
چکیده
The search for possible formalizations of logical calculi that are well suited for computer implementations is in the core of the methodological studies in the area of Automated Reasoning (cf. [1], [4], [5]). The theory of resolution proof systems developed in [4] provides a formal framework for the construction and study of the deductive proof systems based on the resolution principle. Resolution proof systems discussed in [4] are represented by algebraic structures called resolution algebras. If L is a propositional language (here, an absolutely free algebra of a finite similarity type with a countably infinite set of free generators), then a resolution algebra on L is an algebraic structure
منابع مشابه
On a special class of Stanley-Reisner ideals
For an $n$-gon with vertices at points $1,2,cdots,n$, the Betti numbers of its suspension, the simplicial complex that involves two more vertices $n+1$ and $n+2$, is known. In this paper, with a constructive and simple proof, wegeneralize this result to find the minimal free resolution and Betti numbers of the $S$-module $S/I$ where $S=K[x_{1},cdots, x_{n}]$ and $I$ is the associated ideal to ...
متن کاملClausal Resolution for CTL*
In this paper we consider proof techniques for branching-time temporal logics. While a considerable amount of research has been carried out regarding the relationship between finite automata and such logics, practical proof techniques for such logics have received relatively little attention. Recently, however, several applications requiring refined proof methods for branching-time temporal log...
متن کاملOn the Relation of Resolution and Tableaux Proof Systems for Description Logics
This paper investigates the relationship between resolution and tableaux proof system for the satisfiability of general knowledge bases in the description logic We show that resolut ion proof systems can polynornially simulate their tableaux counterpart. Our resolution proof system is based on a selection refinement and utilises standard redundancy el imination criteria to ensure terminat ion.
متن کاملResolution-Based Proof for Multi-Modal Temporal Logics of Knowledge
Temporal logics of knowledge are useful in order to specify complex systems in which agents are both dynamic and have information about their surroundings. We present a resolution method for propositional temporal logic combined with multi-modal S5 and illustrate its use on examples. This paper corrects a previous proposal for resolution in multi-modal temporal logics of knowledge.
متن کاملModal Theorem Proving
We describe resolution proof systems for several modal logics. First we present the propo-sitional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly. This new resolution rule enables us to extend our propositional systems to complete first-order systems. The systems for the different modal lo...
متن کامل